Tree-Decomposition based Algorithms for Abstract Argumentation Frameworks
نویسندگان
چکیده
Goal • Development of novel algorithms for stable, complete and admissible semantics, following up the work of Dvořák et.al. [1] • Based on Tree Decompositions, tractable • Evaluation of different types of Tree Decompositions Overview • Argumentation Frameworks (AFs) important reseach field in Artificial Intelligence • Selection of 'appropriate' arguments from AF defined by a semantics • Many different semantics • Selection oftentimes computationally hard (intractable) ➞ Identify tractable fragments For AFs: Tree-Width, defined on Tree Decompositions Motivation Basic Definitions
منابع مشابه
ZJU-ARG: A Decomposition-Based Solver for Abstract Argumentation
Argumentation Qianle Guo and Beishui Liao 1 Center for the Study of Language and Cognition, Zhejiang University, Hangzhou 310028, P.R.China 2 University of Luxembourg, Luxembourg Abstract. This paper gives the system description of a solver for abstract argumentation ZJU-ARG submitted to the First International Competition on Computational Models of Argumentation (ICCMA’15). It adopts a decompo...
متن کاملdynPARTIX 2.0 - Dynamic Programming Argumentation Reasoning Tool
Most reasoning tasks in abstract argumentation are in general computationally hard. One approach of dealing with such problems stems from the field of parameterized complexity theory. For so called fixed-parameter tractable algorithms, one identifies problem parameters, e.g. the graph parameter tree width, such that the run-time of algorithms heavily scales with the parameter but only polynomia...
متن کاملTowards Fixed-Parameter Tractable Algorithms for Argumentation
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have been identified. In particular, Dunne showed that many problems can be solved in linear time for argumentation frameworks of bounded tree-width. However, these tractability results, which were obtained via Courcelle’s Th...
متن کاملProof Theories and Algorithms for Abstract Argumentation Frameworks
Previous chapters have focussed on abstract argumentation frameworks and properties of sets of arguments defined under various extension-based semantics. The main focus of this chapter is on more procedural, proof-theoretic and algorithmic aspects of argumentation. In particular, Chapter 2 describes properties of extensions of a Dung argumentation framework 〈A ,R〉 under various semantics. In th...
متن کاملComputational Aspects of Abstract Argumentation
This work is in the context of formal argumentation, a sub-field of Artificial Intelligence. Probably the most popular formalism in argumentation is abstract argumentation as introduced by Dung [42]. So called abstract argumentation frameworks abstract from the actual content of arguments and represent them as abstract entities and further abstract from the reasons of conflicts between argument...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012